Of course, part of the power of lists comes in recursive processing of the list elements, which simply means pulling the head from the list until the list is empty, then accumulating the results 当然,列表的强大力量部分来自于递归处理列表元素的能力,这表示可以从列表提取头部,直到列表为空,然后累积结果
The program then seeds the recursive function with the first item on the list and the remaining list. 然后程序以列表中的第一项及其余部分列表为种子开始递归函数。
Notice how like our recursive programs, the definition of a linked list also contains a base case& in this case, the NULL pointer. 注意,与我们的递归程序非常类似,链表的定义也包括一个基线条件&在这里是NULL指针。